Difference Sets Corresponding to a Class of Symmetric Designs
نویسندگان
چکیده
Abstract. We study difference sets with parameters (v, k, λ) = (ps(r2m − 1)/(r − 1), ps−1r2m−1, ps−2(r − 1)r2m−2), where r = (ps − 1)/(p − 1) and p is a prime. Examples for such difference sets are known from a construction of McFarland which works for m = 1 and all p, s. We will prove a structural theorem on difference sets with the above parameters; it will include the result, that under the self-conjugacy assumption McFarland’s construction yields all difference sets in the underlying groups. We also show that no abelian (160, 54, 18)difference set exists. Finally, we give a new nonexistence prove of (189, 48, 12)-difference sets in Z3 ×Z9 ×Z7.
منابع مشابه
New Regular Partial Difference Sets and Strongly Regular Graphs with Parameters (96, 20, 4, 4) and (96, 19, 2, 4)
New (96,20,4,4) and (96,19,2,4) regular partial difference sets are constructed, together with the corresponding strongly regular graphs. Our source are (96,20,4) regular symmetric designs.
متن کاملLinking systems in nonelementary abelian groups
Linked systems of symmetric designs are equivalent to 3-class Q-antipodal association schemes. Only one infinite family of examples is known, and this family has interesting origins and is connected to important applications. In this paper, we define linking systems, collections of difference sets that correspond to systems of linked designs, and we construct linking systems in a variety of non...
متن کاملVariations on the McFarland and Spence constructions of difference sets
We give two new constructions of symmetric group divisible designs using divisible difference sets. These constructions generalize the McFarland and Spence constructions of symmetric designs. Divisible designs are of interest in several parts of mathematics: The design theorist needs classes of divisible designs as "ingredients" for recursive constructions of designs. Statisticians use divisibl...
متن کاملDesigns with the Symmetric Difference Property on 64 Points and Their Groups
The automorphism groups of the symmetric 2-(64, 28, 12) designs with the symmetric difference property (SDP), as well as the groups of their derived and residual designs, are computed. The symmetric SDP designs all have transitive automorphism groups. In addition, they all admit transitive regular subgroups, or equivalently, (64, 28, 12) difference sets. These results are used for the enumerati...
متن کاملNote on GMW Designs
Let N and n be integers such that n|N and 2 < n < N . Let q be a prime power. The difference sets introduced by Gordon, Mills and Welch in [1] produce symmetric designs with the same parameters v = (q N −1)/(q−1), k = (q N−1−1)/(q−1), λ = (q N−2−1)/(q−1) as the point-hyperplane design of PG(N − 1, q). The purpose of this note is to prove that inequivalent difference sets of this sort produce no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 10 شماره
صفحات -
تاریخ انتشار 1997